Course Allocation by Proxy Auction

نویسندگان

  • Scott Duke Kominers
  • Michael Ruberry
  • Jonathan Ullman
چکیده

We propose a new proxy bidding mechanism to allocate courses to students given students’ reported preferences. Our mechanism is motivated by a specific strategic downgrading manipulation observed in the course allocation mechanism currently used at Harvard Business School (HBS). The proxy bidding mechanism simplifes students’ decisions by directly incorporating downgrading into the mechanism. Our proxy bidding mechanism is Pareto efficient with respect to lexicographic preferences and can be extended to allow for a more expressive preference language which allows complementarity, substitutability, and indifference. Simulations suggest that the proxy bidding mechanism is robust to the manipulations observed in the HBS mechanism and may yield welfare improvements.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Accelerated Implementations of the Ascending Proxy Auction

Combinatorial auctions have important applications to resource allocation problems. These auctions allow bidders to submit bids for entire packages of goods, rather than on single items. This rich bidder interface allows bidders to specify their preferences more precisely, and as a result, allows for more efficient allocation of resources. However, these allowances to bidders come at a computat...

متن کامل

Ascending Combinatorial Scoring Auctions

In multi-attribute procurement auctions with multiple objects, the auctioneer may care about the interplay of quality attributes that do not belong to the same item – like each item’s delivery time, if all items are needed at once. This can influence the performance of the auction mechanism. We generalize the Ausubel-Milgrom ascending proxy auction to such an environment and show that the main ...

متن کامل

Agents' Bidding Strategies in a Combinatorial Auction Controlled Grid Environment

We present an agent-based simulation environment for resource allocation in a distributed computer system that employs a combinatorial task scheduler. Our environment enables the simulation of a mechanism for the simultaneous allocation of resources like CPU time (CPU), communication bandwidth (NET), volatile (MEM) and non-volatile memory (DSK) in the distributed computer system. In contrast to...

متن کامل

Using Shadow Prices for Resource Allocation in a Combinatorial Grid with Proxy-Bidding Agents

Our paper presents an agent-based simulation environment for task scheduling in a distributed computer systems (grid). The scheduler enables the simultaneous allocation of resources like CPU time, communication bandwidth, volatile and non-volatile memory while employing a combinatorial resource allocation mechanism. The resource allocation is performed by an iterative combinatorial auction in w...

متن کامل

Computing price trajectories in combinatorial auctions with proxy bidding

Proxy bidding has proved useful in a variety of real auction formats, such as eBay, and has been proposed for combinatorial auctions. Previous work on proxy bidding in combinatorial auctions requires the auctioneer essentially run the auction with myopic bidders to determine the outcome. In this paper we present a radically different approach that computes the bidders’ allocation of their atten...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010